Capacity Planning of Survivable MPLS Networks Supporting DiffServ

نویسندگان

  • Kehang Wu
  • Douglas S. Reeves
چکیده

It is essential for ISPs to offer both performance and survivability guarantees at the IP/MPLS layer. Capacity planning is needed to ensure there will be sufficient resource availability and quality of service under normal circumstances, and during network failures. In this paper we study the issue of capacity planning for survivable MPLS networks providing DiffServ EF and BE traffic classes. Our goal is to minimize the total link cost, subject to the performance and survivability constraints of both EF and BE classes. The problem is formulated as an optimization problem, where we jointly select the routes for edge to edge EF and BE user demand pairs, and assign a discrete capacity value for each link. Capacity for the EF class is fully restorable under the single link failure model, while restorability of the BE class can be adjusted by the network operator. We propose an efficient solution approach based on the Lagrangian Relaxation and subgradient methods. Computational results show that the solution quality is within a few percent of optimal, while the running time remains reasonable for networks with 1000 nodes, 2500 links, and 40,000 demand pairs. This represents the first work on capacity planning for survivable multiple-class-of-service IP/MPLS networks with non-linear performance constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE traffic classes

Capacity planning is indispensable for future Internet providing QoS. Accurate dimensioning is especially important when no per-flow signaling or control exists. In this paper, we address the problem of link dimensioning and Lable Switching Path (LSP) optimization for MPLS networks supporting DiffServ EF and BE traffic classes. The problem is formulated as an optimization problem, where the goa...

متن کامل

Flow Admission Control for MPLS Support of DiffServ

In this thesis, an efficient traffic flow admission control mechanism supporting DiffServ is proposed to provide QoS in MPLS networks. We propose a dynamic and flexible flow admission control for MPLS support of DiffServ to prevent the waste of resources. Ingress LSRs may collect information to find out the congested area using control messages exchanged in QoS routing. We exclude the congested...

متن کامل

Routing Optimization in IP/MPLS Networks under Per-Class Over-Provisioning Constraints

MPLS (Multi-Protocol Label Switching) and DiffServ (Differentiated Services) provide means to implement various QoS types in IP networks. While MPLS enhances the classical IP networks by supporting efficient connection control through explicit label-switched paths (LSPs), DiffServ allows differentiated QoS parameters commitments to be supported on the same IP backbone for different classes of s...

متن کامل

Supporting End-to-End QoS in DiffServ/MPLS Networks

In MPLS networks, the higher-priority LSP (Label Switching Path) will preempt the resource of lowerpriority LSP when its bandwidth resource is limited. At the time, the lower-priority LSP is destroyed, and its bandwidth resource is released to the higher-priority LSP. The destroyed path has to be rerouted by selecting another LSP; the new LSP maybe quickly suffer another bandwidth resource pree...

متن کامل

DiffServ and MPLS – Concepts and Simulation

Differentiated Services (DiffServ) is scalable for deployment in today’s Internet, and Multiprotocol Label Switching (MPLS) provides fast packet switching and the opportunity for traffic engineering. Thus, the combination of DiffServ and MPLS presents a very attractive strategy to backbone network providers. This paper attempts to explain the concepts of DiffServ + MPLS and illustrate its effec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004